Parameter Estimation in Pair-hidden Markov Models

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameter estimation in pair hidden Markov models

This paper deals with parameter estimation in pair hidden Markov models (pairHMMs). We first provide a rigorous formalism for these models and discuss possible definitions of likelihoods. The model being biologically motivated, some restrictions with respect to the full parameter space naturally occur. Existence of two different Information divergence rates is established and divergence propert...

متن کامل

Information Geometry Approach to Parameter Estimation in Hidden Markov Models

We consider the estimation of hidden Markovian process by using information geometry with respect to transition matrices. We consider the case when we use only the histogram of k-memory data. Firstly, we focus on a partial observation model with Markovian process and we show that the asymptotic estimation error of this model is given as the inverse of projective Fisher information of transition...

متن کامل

Parameter Estimation for Hidden Markov Models with Intractable Likelihoods

Approximate Bayesian computation (ABC) is a popular technique for approximating likelihoods and is often used in parameter estimation when the likelihood functions are analytically intractable. Although the use of ABC is widespread in many fields, there has been little investigation of the theoretical properties of the resulting estimators. In this paper we give a theoretical analysis of the as...

متن کامل

Learning Morphology with Pair Hidden Markov Models

In this paper I present a novel Machine Learning technique based on Pair Hidden Markov Models, a statistical model used in bioinformatics. This technique can be used to learn nite-state string to string transductions. I present a model of the acquisition of the English past tense. The same model can also learn without modiication the Arabic broken plural, a much more complex morphological syste...

متن کامل

Pair hidden Markov models on tree structures

MOTIVATION Computationally identifying non-coding RNA regions on the genome has much scope for investigation and is essentially harder than gene-finding problems for protein-coding regions. Since comparative sequence analysis is effective for non-coding RNA detection, efficient computational methods are expected for structural alignments of RNA sequences. On the other hand, Hidden Markov Models...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scandinavian Journal of Statistics

سال: 2006

ISSN: 0303-6898,1467-9469

DOI: 10.1111/j.1467-9469.2006.00513.x